Construction of Pattern Database Heuristics using Cost Partitioning
نویسنده
چکیده
Pattern databases (Culberson & Schae er, 1998) or PDBs, have been proven very e ective in creating admissible Heuristics for single-agent search, such as the A*-algorithm. Haslum et. al proposed, a hill-climbing algorithm can be used to construct the PDBs, using the canonical heuristic. A di erent approach would be to change action-costs in the pattern-related abstractions, in order to obtain the admissible heuristic. This the so called Cost-Partitioning.
منابع مشابه
Better Orders for Saturated Cost Partitioning in Optimal Classical Planning
Cost partitioning is a general method for adding multiple heuristic values admissibly. In the setting of optimal classical planning, saturated cost partitioning has recently been shown to be the cost partitioning algorithm of choice for pattern database heuristics found by hill climbing, systematic pattern database heuristics and Cartesian abstraction heuristics. To evaluate the synergy of the ...
متن کاملA Comparison of Cost Partitioning Algorithms for Optimal Classical Planning
Cost partitioning is a general and principled approach for constructing additive admissible heuristics for state-space search. Cost partitioning approaches for optimal classical planning include optimal cost partitioning, uniform cost partitioning, zero-one cost partitioning, saturated cost partitioning, post-hoc optimization and the canonical heuristic for pattern databases. We compare these a...
متن کاملAdditive Pattern Database Heuristics
We explore a method for computing admissible heuristic evaluation functions for search problems. It utilizes pattern databases (Culberson & Schaeffer, 1998), which are precomputed tables of the exact cost of solving various subproblems of an existing problem. Unlike standard pattern database heuristics, however, we partition our problems into disjoint subproblems, so that the costs of solving t...
متن کاملNew Admissible Heuristics for Domain-Independent Planning
Admissible heuristics are critical for effective domainindependent planning when optimal solutions must be guaranteed. Two useful heuristics are the h heuristics, which generalize the reachability heuristic underlying the planning graph, and pattern database heuristics. These heuristics, however, have serious limitations: reachability heuristics capture only the cost of critical paths in a rela...
متن کاملDomain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively guide the search. Pattern database heuristics (PDBs), which are based on abstractions of the search space, are currently one of the most promising approaches to developing better admissible heuristics. The informedness of...
متن کامل